Parallel Magnetic Resonance Imaging Reconstruction by Image Editing

نویسنده

  • J. Shen
چکیده

Introduction In aliased images, pixels from different parts of the field of view overlap. The task of parallel imaging reconstruction is equivalent to extracting each individual pixel from the sum. Magnetic resonance spectroscopy (MRS) has long sought to extract a signal of interest from overlapping signals at the same frequency using various spectral editing techniques. One very effective spectral editing technique uses a two-step procedure (1). In the first step, the intact overlapped spectrum is acquired. In the second step, the signal of interest is selectively inverted via through-bond scalar coupling interactions while leaving the undesired overlapping signals at the same frequency unchanged. An edited spectrum revealing the signal of interest is thus generated by subtracting the perturbed spectrum from the intact spectrum. Here we present a parallel imaging reconstruction method inspired by MRS spectral editing. The original aliased images correspond to the intact spectrum. A perturbed aliased image corresponding to the perturbed spectrum is synthesized using acquired aliased images. In the perturbed images, each pixel is still a complex summation of multiple pixels, but the sign of one pixel in the sum is inverted. The unaliased image for each receive coil can be generated by subtracting the perturbed image from the corresponding intact image using an “image editing” procedure. Theory Let Ac(m,n) represent the m,n pixel in the aliased image acquired by coil c with an acceleration factor R, where m and n are the pixel index along the readout and phase-encoding directions, respectively. m ∈ {1,M} and n ∈ {1,N/R}. We have Ac(m,n) =sumj=1~R{Uc(m,n+(j-1)N/R)} [1], where U denotes the unaliased M×N image, and j is the index of aliased FOV. j ∈ {1,R}. The perturbed image P for the ith aliased FOV can be expressed as Pic(m,n) = sumj=1~R{(-1)Uc(m,n+(j1)N/R)}[2], where δij is Kronecker’s delta. The unaliased images is derived by subtracting the perturbed images from the aliased ones: Uc(m,n+(j-1)N/R)∝Ac(m,n)-Pjc(m,n) [3]. According to Eqs. [1-2], a low-resolution version of Pic and Ac images can be calculated from the corresponding low-resolution unaliased image (uc, M×N) using a small, fully sampled k space core (M×N). The perturbed low resolution image matrix can be recast into a spatially varying linear combination of aliased images: pc=sumover all coils (c’){sc’c•I1×R⊗ac’} [4], where I1×R = [1...1] is onedimensional row vector (1×R), C is the total number of receive coils, sc’c is the spatially varying weighting matrix (M×N) representing the contribution from coil c’ to coil c in the synthesis of pc, • denotes element-by-element multiplication, and ⊗ denotes tensor product. Eq. [4] can be used to calibrate sc’c after decomposing it into a model functions with spatially invariant coefficients. These coefficients will then be used to synthesize the perturbed high resolution image matrix after interpolating sc’c over M×N. The intended unaliased Uc can then be calculated or “edited” using Eq. [3]. Methods and Results Fully sampled MPRAGE images (256x256, slice thickness=1.3 mm acquired at 3T with an eight channel receive coil) were used to test the image editing method. To minimize the difference between Uc and Ac images (i.e., to maximally match the image content for better imaging domain fitting) for even-numbered R, the 1~N/2R and N/2R+1~N/R halves of the original aliased images generated by Fourier transform were swapped. Fig. 1 compares the effect of this sub-FOV swapping procedure on the quality of reconstructed images for R = 2. Fig. 1(1a) shows the fully sampled, sum-of-square magnitude MPRAGE image. Fig. 1(2a) shows the edited image. A low-resolution unaliased image (128 × 16) generated from the fully sampled central region of the k space core with eight ACS lines was used to determine the image synthesis kernel according to Eq. [4]. The mean square error is 1.1%. Using direct Fourier transform of the undersampled k space data, the negative frequency half of the aliased image corresponded to sub-FOVs N/4+1~N/2 and 3N/4+1~N; the positive frequency half of the aliased image corresponded to sub-FOVs 1~N/4 and N/2+1~3N/4. If these two halves were not swapped, the resulting and much greater difference between Pc and Ac images would put higher demand on the image fitting procedure, leading to poorer reconstructed images. Fig. 1(3a) shows the reconstruction result without applying the swapping procedure to ac and Ac images. To further illustrate the image editing process, Fig 1(1b-3b) shows the positive real mode Ac, Pc images as well as the image subtraction result (Uc) for c = 1 according to Eq. [3]; Fig 1(1c-3c) shows the corresponding positive imaginary mode images; Fig 1(1d-3d) shows the corresponding absolute mode images. For comparison with a standard GRAPPA method developed by Dr. F.H. Lin (http://www.nmr.mgh. harvard.edu/~fhlin/tool_sense.htm, 2) Figs. 2(1a,1b) show the fully sampled MPRAGE image. In Fig. 2(2a), the image editing method (R=3, 22 ACS lines) was employed. The difference image (x8) is shown in Fig. 2(3a). The mean square reconstruction error is 1.4%. The reconstructed image and the difference image(x8) using the standard GRAPPA algorithm was shown in Figs. 2(2b,3b). The GRAPPA reconstruction used 24 ACS lines with a mean square reconstruction error is 1.6%. To investigate potential field-of-view limitations of the proposed image editing method we also performed numerical simulations to examine the effect of prescribing a FOV smaller than the size of the object. The appearance of the aliasing in the reconstructed image was found to be exactly the same as in the unaccelerated image (Fig. 3, R = 3, 1: fully sampled image; 2: image unwrapped using editing; 3: diff.x8). Discussion The results showed that image editing is comparable to GRAPPA in terms of reconstruction errors. It is noted, however, image editing used longer computation time than GRAPPA does. This increased computation cost is, in part, due to our data fitting procedure performed in the image domain. The image domain-based SENSE reconstruction method fails when the prescribed FOV in phase-encoding direction is smaller than the region occupied by the object (3). We found that although the image editing method also uses image domain fitting, it does not suffer from this deficiency associated with SENSE. Using image editing, when sc’c is empirically determined using the fully sample k space core no assumption is made on whether the prescribed FOV is larger or smaller than the object. If Ac contains preexisting aliasing due to the size of unaccelerated FOV being smaller than the size of the object, this preexisting aliasing is passed to Pc from Ac. In Pc, the sign of pixels originated from subFOVs is reversed sequentially. This sign reversal also applies to any preexisting aliasing in the subFOVs. Other than the two subFOVs located at the two edges along the accelerated direction the sign of the preexisting aliased pixels are not reversed. When Pc is subtracted out from Ac to generated reconstructed image Uc, the preexisting aliased pixels are cancelled everywhere in Uc except at the two edges along the accelerated direction. In conclusion, we demonstrated that parallel imaging reconstruction can be accomplished using image editing, similar to spectral editing in MRS. References 1. Rothman et al, PNAS, 90, 5662 (1993). 2. Tsai et al, MRM, 59, 989 (2008). 3. Griswold et al, MRM. 52:1118 (2004). Fig. 2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modulation Recovery and Image Reconstruction in Cartesian Parallel Magnetic Resonance Imaging: a Structural Study by Parameterization

Parallel Magnetic Resonance Imaging allows to reduce image acquisition time by subsampling the data in k-space using an array of surface coils. The subsampling using surface coils results in modulated and aliased images which have to be post-treated to reconstruct the image. In this paper we perform a structural study for simultaneous recovery of the unknown coil sensitivities and reconstructio...

متن کامل

Magnetic Resonance in Medicine 71:1760–1770 (2014) Monte Carlo SURE-Based Parameter Selection for Parallel Magnetic Resonance Imaging Reconstruction

Purpose: Regularizing parallel magnetic resonance imaging (MRI) reconstruction significantly improves image quality but requires tuning parameter selection. We propose a Monte Carlo method for automatic parameter selection based on Stein’s unbiased risk estimate that minimizes the multichannel k-space mean squared error (MSE). We automatically tune parameters for image reconstruction methods th...

متن کامل

Sparse BLIP: BLind Iterative Parallel imaging reconstruction using compressed sensing.

PURPOSE To develop a sensitivity-based parallel imaging reconstruction method to reconstruct iteratively both the coil sensitivities and MR image simultaneously based on their prior information. METHODS Parallel magnetic resonance imaging reconstruction problem can be formulated as a multichannel sampling problem where solutions are sought analytically. However, the channel functions given by...

متن کامل

Parallel Imaging Reconstruction by Sense Algorithm

The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil configurations and k-space sampling patterns. To achieve increased acquisition speed in magnetic resonance imaging Special attention is given to the currently most practical case, namely, sampling a common Cartesian grid with reduced density. Scan time was reduced t...

متن کامل

Parallel spectroscopic imaging reconstruction with arbitrary trajectories using k-space sparse matrices.

Parallel imaging reconstruction has been successfully applied to magnetic resonance spectroscopic imaging (MRSI) to reduce scan times. For undersampled k-space data on a Cartesian grid, the reconstruction can be achieved in image domain using a sensitivity encoding (SENSE) algorithm for each spectral data point. Alternative methods for reconstruction with undersampled Cartesian k-space data are...

متن کامل

Sparse Constrained Reconstruction for Accelerating Parallel Imaging Based on Variable Splitting Method

Parallel imaging is a rapid magnetic resonance imaging technique. For the ill-conditioned problem, noise and aliasing artifacts are amplified during the reconstruction process and are serious especially for high accelerating imaging. In this paper, a sparse constrained reconstruction problem is proposed for parallel imaging, and an effective solution based on the variable splitting method is co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010